Sunflowers and -intersecting families
نویسندگان
چکیده
منابع مشابه
Chain Intersecting Families
Let F be a family of subsets of an n-element set. F is called (p,q)-chain intersecting if it does not contain chains A1 ( A2 ( · · · ( Ap and B1 ( B2 ( · · · ( Bq with Ap∩Bq = ∅. The maximum size of these families is determined in this paper. Similarly to the p = q = 1 special case (intersecting families) this depends on the notion of r-complementing-chain-pair-free families, where r = p + q − ...
متن کاملCompressions and Probably Intersecting Families
A family A of sets is said to be intersecting if A ∩ B 6= ∅ for all A, B ∈ A. It is a well-known and simple fact that an intersecting family of subsets of [n] = {1, 2, . . . , n} can contain at most 2n−1 sets. Katona, Katona and Katona ask the following question. Suppose instead A ⊂ P[n] satisfies |A| = 2n−1 + i for some fixed i > 0. Create a new family Ap by choosing each member of A independe...
متن کاملRegular Intersecting Families
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families F of k-element subsets of [n] := {1, . . . , n}, such that every element of [n] lies in the same (or approximately the same) number of members of F . In particular, we show that we can guarantee |F| = o( ( n−1 k−1 ) ) if and only if k = o(n).
متن کاملG-Intersecting Families
Let G be a graph on vertex set [n], and for X [n] let N(X) be the union of X and it's neighborhood in G. A family of sets F 2 is G-intersecting if N(X) \ Y 6= ; for all X;Y 2 F . In this paper we study the cardinality and structure of the largest k-uniform G-intersecting families on a xed graph G.
متن کاملMultiply-intersecting families
Intersection problems occupy an important place in the theory of finite sets. One of the central notions is that of a r-wise r-intersecting family, that is, a collection holds for all choices of 1 < il < < i, < m. What is the maximal size m = m(n, r, t) of a r-wise t-intersecting family? Taking all subsets containing a fixed t-element set shows that m(n, r, 1) > 2 "-' holds for all n 3 f 2 0. O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2020
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2019.02.005